Expanding Polynomials and Connectedness of Self-Affine Tiles
نویسندگان
چکیده
منابع مشابه
Expanding Polynomials and Connectedness of Self-Affine Tiles
Little is known about the connectedness of self-affine tiles inRn . In this note we consider this property on the self-affine tiles that are generated by consecutive collinear digit sets. By using an algebraic criterion, we call it the height reducing property, on expanding polynomials (i.e., all the roots have moduli > 1), we show that all such tiles in Rn, n ≤ 3, are connected. The problem is...
متن کاملOn the Connectedness of Self-affine Tiles
Let T be a self-affine tile in 2n defined by an integral expanding matrix A and a digit set D. The paper gives a necessary and sufficient condition for the connectedness of T. The condition can be checked algebraically via the characteristic polynomial of A. Through the use of this, it is shown that in 2#, for any integral expanding matrix A, there exists a digit set D such that the correspondi...
متن کاملClassification of Integral Expanding Matrices and Self-Affine Tiles
Let T be a self-affine tile that is generated by an expanding integral matrix A and a digit set D. It is known that many properties of T are invariant under the Z-similarity of the matrix A. In [LW1] Lagarias and Wang showed that if A is a 2 × 2 expanding matrix with |det(A)| = 2, then the Z-similar class is uniquely determined by the characteristic polynomial of A. This is not true if |det(A)|...
متن کاملRational Self-affine Tiles
An integral self-affine tile is the solution of a set equation AT = ⋃d∈D(T +d), where A is an n× n integer matrix and D is a finite subset of Z. In the recent decades, these objects and the induced tilings have been studied systematically. We extend this theory to matrices A ∈ Qn×n. We define rational self-affine tiles as compact subsets of the open subring R ×∏pKp of the adèle ring AK , where ...
متن کاملGeometry of Self { Affine Tiles
For a self{similar or self{aane tile in R n we study the following questions: 1) What is the boundary? 2) What is the convex hull? We show that the boundary is a graph directed self{aane fractal, and in the self{similar case we give an algorithm to compute its dimension. We give necessary and suucient conditions for the convex hull to be a polytope, and we give a description of the Gauss map of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Computational Geometry
سال: 2004
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-003-2879-8